An Efficient Computational Method for Non-Stationary (R,S) Inventory Policy with Service Level Constraints
نویسندگان
چکیده
This paper provides an efficient computational approach to solve the mixed integer programming (MIP) model developed by Tarim and Kingsman (2004) for calculating the parameters of an (R,S) policy in a finite horizon with nonstationary stochastic demand and service level constraints. Given the replenishment periods, we characterize the optimal order-up-to levels for the MIP model and use it to guide the development of a relaxed MIP model, which can be solved in polynomial time. The effectiveness of the proposed method hinges on three novelties: (i) the proposed relaxation is computationally efficient and yields an optimal solution most of the time, (ii) if the relaxation produces an infeasible solution, this solution can be used as a tight lower bound, and also (iii) this infeasible solution can be modified easily to obtain a feasible solution, which is an upper bound for the optimal solution. In case of infeasibility, the relaxation approach is implemented at each node of the search tree in a simple branch-and-bound procedure to efficiently search for an optimal solution. Extensive numerical tests show that our method dominates the MIP solution approach and can handle real-life size problems in trivial time.
منابع مشابه
Optimal (R, Q) policy and pricing for two-echelon supply chain with lead time and retailer’s service-level incomplete information
Many studies focus on inventory systems to analyze different real-world situations. This paper considers a two-echelon supply chain that includes one warehouse and one retailer with stochastic demand and an up-to-level policy. The retailer’s lead time includes the transportation time from the warehouse to the retailer that is unknown to the retailer. On the other hand, the warehouse is unaware ...
متن کاملA Global Constraint for Computing Exact Buffer Stock Levels in Stochastic Inventory Control
Inventory theory provides methods for managing and controlling inventories under different constraints and environments. We consider a class of production/inventory control problems that has a single product and a single stocking location, when a stochastic demand with a known non-stationary probability distribution is given. A control policy for this type of inventory system is the one where t...
متن کاملComputing Replenishment Cycle Policy under Non-stationary Stochastic Lead Time
In this paper we address the general multi-period production/inventory problem with non-stationary stochastic demand and supplier lead time under service-level constraints. A replenishment cycle policy (Rn,Sn) is modeled, where Rn is the n-th replenishment cycle length and Sn is the respective order-up-to-level. Initially we extend an existing formulation for this policy in a way to incorporate...
متن کاملPeriodic Review for a Perishable Item under Non Stationary Stochastic Demand
We consider the periodic-review, single-location, single-product, production/inventory control problem under non stationary demand and service-level constraints. The product is perishable and has a fixed shelf life. Costs comprise fixed ordering costs and inventory holding costs. For this inventory system we discuss a number of control policies that may be adopted. For one of these policies, we...
متن کاملReplenishment Cycle Policy Parameters for a Perishable Item
In many industrial environments there is a significant class of problems for which the perishable nature of the inventory cannot be ignored in developing replenishment order plans. Food is the most salient example of a perishable inventory item. In this work, we consider the periodic-review, single-location, single-product production/inventory control problem under non-stationary stochastic dem...
متن کامل